Improved bounds on identifying codes in binary Hamming spaces
نویسندگان
چکیده
منابع مشابه
Links Between Discriminating and Identifying Codes in the Binary Hamming Space
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On) the set of vectors with even (respectively, odd) weight. For r 1 and x 2 Fn, we denote by Br(x) the ball of radius r and centre x. A code C Fn is said to be r-identifying if the sets Br(x)\C, x 2 Fn, are all nonempty and distinct. A code C En is said to be r-discrimi...
متن کاملec 2 00 5 SPECTRAL APPROACH TO LINEAR PROGRAMMING BOUNDS ON CODES
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal polynomials. The examples of the method considered in the paper include binary codes, binary constant-weight codes, spherical codes, and codes in the projective...
متن کاملDiscriminating and Identifying Codes in the Binary Hamming Space
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On) the set of vectors with even (respectively, odd) weight. For r ≥ 1 and x ∈ Fn, we denote by Br(x) the ball of radius r and centre x. A code C ⊆ Fn is said to be r-identifying if the sets Br(x)∩C, x ∈ F n, are all nonempty and distinct. A code C ⊆ En is said to be r-d...
متن کاملIdentifying Codes in q-ary Hypercubes
Let q be any integer ≥ 2. In this paper, we consider the q-ary ndimensional cube whose vertex set is Znq and two vertices (x1, . . . , xn) and (y1, . . . , yn) are adjacent if their Lee distance is 1. As a natural extension of identifying codes in binary Hamming spaces, we further study identifying codes in the above q-ary hypercube. We let M t (n) denote the smallest cardinality of t-identifyi...
متن کاملNew upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
We give a new upper bound on the maximum size Aq(n, d) of a code of word length n and minimum Hamming distance at least d over the alphabet of q ≥ 3 letters. By blockdiagonalizing the Terwilliger algebra of the nonbinary Hamming scheme, the bound can be calculated in time polynomial in n using semidefinite programming. For q = 3, 4, 5 this gives several improved upper bounds for concrete values...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 31 شماره
صفحات -
تاریخ انتشار 2010